In Search of the Optimal Searching Sequence for VQ Encoding - Communications, IEEE Transactions on
نویسندگان
چکیده
The codeword searching sequence is sometimes very vital to the efficiency of a vector quantization (VQ) encoding algorithm. In this paper, we evaluate some necessary criteria for the derivation of an optimal searching sequence and derive the optimal searching sequence based on such criteria.
منابع مشابه
In search of the optimal searching sequence for VQ encoding
|The codeword searching sequence is sometimes very vital to the e ciency of a VQ encoding algorithm. In this paper, we evaluate some necessary criteria for the derivation of an optimal searching sequence and derive the optimal searching sequence based on such criteria.
متن کاملThree Improved Codebook Searching Algorithms for Image Compression Using Vector Quantizer
In this paper, we propose three improved codebook searching algorithms for vector quantization (VQ). Our improved schemes are based on three fast searching methods proposed by Huang et al., IEEE Transactions on Image Processing, 1 (3), 1992, 413–416 and the double test (DT) method proposed by Torres and Huguet, IEEE Transactions on Communications, 42 (2|3|4), 1994, 208–210. Compared with three ...
متن کاملIn Search of the Optimal Searching Sequencefor
| The codeword searching sequence is sometimes very vital to the eeciency of a VQ encoding algorithm. In this paper, we evaluate some necessary criteria for the derivation of an optimal searching sequence and derive the optimal searching sequence based on such criteria.
متن کاملFast nearest neighbor search of entropy-constrained vector quantization
Entropy-constrained vector quantization (ECVQ) offers substantially improved image quality over vector quantization (VQ) at the cost of additional encoding complexity. We extend results in the literature for fast nearest neighbor search of VQ to ECVQ. We use a new, easily computed distance that successfully eliminates most codewords from consideration.
متن کاملVariable dimension VQ encoding and codebook design
A variable dimension vector quantizer (VDVQ) has codewords of unequal dimensions. Here, a trellis-based sequential optimal VDVQ encoding algorithm is proposed. Also, a VDVQ codebook design algorithm based on splitting a node with equal or reduced dimensions is proposed that does not require any codebook parameter to be prespecified unlike known schemes. The VDVQ system is shown to outperform a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009